Combinatorial game theory

Results: 236



#Item
21Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Add to Reading List

Source URL: emarkou.users.uth.gr

Language: English - Date: 2016-05-24 11:28:43
22On the Stable Matchings that can be Reached When the Agents Go Marching in One by One Christine T. Cheng University of Wisconsin-Milwaukee October 12, 2015 Abstract

On the Stable Matchings that can be Reached When the Agents Go Marching in One by One Christine T. Cheng University of Wisconsin-Milwaukee October 12, 2015 Abstract

Add to Reading List

Source URL: www.cs.uwm.edu

Language: English - Date: 2015-10-14 10:33:14
23Combinatorial Auctions with Restricted Complements Ittai Abraham Microsoft Research, Silicon Valley  Moshe Babaioff Microsoft Research, Silicon Valley

Combinatorial Auctions with Restricted Complements Ittai Abraham Microsoft Research, Silicon Valley Moshe Babaioff Microsoft Research, Silicon Valley

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2012-04-26 10:21:18
24Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Marina Papatriantafilou Happier times in Iceland,

Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Marina Papatriantafilou Happier times in Iceland,

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2011-05-18 09:51:33
25Genome Informatics 12: 73–A Multi-Queue Branch-and-Bound Algorithm for Anytime Optimal Search

Genome Informatics 12: 73–A Multi-Queue Branch-and-Bound Algorithm for Anytime Optimal Search

Add to Reading List

Source URL: www.jsbi.org

Language: English - Date: 2002-01-17 03:51:05
26Combinatorial Game Theory November 20, Colouring Terminology

Combinatorial Game Theory November 20, Colouring Terminology

Add to Reading List

Source URL: math.colorado.edu

Language: English - Date: 2015-12-04 19:21:55
27Received 10 May 2004 Accepted 16 June 2004 Published online 25 October 2004 The disadvantage of combinatorial communication 

Received 10 May 2004 Accepted 16 June 2004 Published online 25 October 2004 The disadvantage of combinatorial communication 

Add to Reading List

Source URL: octavia.zoology.washington.edu

Language: English - Date: 2004-11-24 18:39:07
28Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan Mar´ıa-Esther Vidal Louiqa Raschid

Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan Mar´ıa-Esther Vidal Louiqa Raschid

Add to Reading List

Source URL: webdb2004.cs.columbia.edu

Language: English - Date: 2004-05-31 19:36:24
29CPSC	
  	
   Combinatorial	
  Auc4ons,	
  Con4nued…	
   Shaili	
  Jain	
   September	
  29,	
  2011	
    Combinatorial	
  Auc4on	
  Model	
  

CPSC     Combinatorial  Auc4ons,  Con4nued…   Shaili  Jain   September  29,  2011   Combinatorial  Auc4on  Model  

Add to Reading List

Source URL: zoo.cs.yale.edu

Language: English - Date: 2011-10-03 03:00:31
30Bandits all the way down: UCB1 as a simulation policy in Monte Carlo Tree Search Edward J. Powley, Daniel Whitehouse, and Peter I. Cowling Department of Computer Science York Centre for Complex Systems Analysis Universit

Bandits all the way down: UCB1 as a simulation policy in Monte Carlo Tree Search Edward J. Powley, Daniel Whitehouse, and Peter I. Cowling Department of Computer Science York Centre for Complex Systems Analysis Universit

Add to Reading List

Source URL: eldar.mathstat.uoguelph.ca

Language: English - Date: 2016-07-12 12:05:04